On the Relation Between Primitive Recursion, Schematization and Divergence
نویسنده
چکیده
The paper presents a new schematization of innnite families of terms called the primal grammars, based on the notion of primitive recursive rewrite systems. This schematization is presented by a generating term and a canonical rewrite system. It is proved that the class of primal grammars covers completely the class of crossed rewrite systems. This proof contains a construction of a primal grammar from a crossed rewrite system.
منابع مشابه
Non-primitive Recursive Function Definitions
This paper presents an approach to the problem of introducing non-primitive recursive function definitions in higher order logic. A recursive specification is translated into a domain theory version, where the recursive calls are treated as potentially non-terminating. Once we have proved termination, the original specification can be derived easily. A collection of algorithms are presented whi...
متن کاملTotal Recursion over Lexicographical Orderings: Elementary Recursive Operators Beyond PR
In this work we generalize primitive recursion in order to construct a hierarchy of terminating total recursive operators which we refer to as leveled primitive recursion of order i(PRi). Primitive recursion is equivalent to leveled primitive recursion of order 1 (PR1). The functions constructable from the basic functions make up PR0. Interestingly, we show that PR2 is a conservative extension ...
متن کاملDependent Type Theory with Parameterized First-Order Data Types and Well-Founded Recursion
We present a variation of Martin-Löf’s logical framework with βιequality, extended with first-order parameterized algebraic data types and recursive pattern-matching definitions. Our contribution is a proof of normalization for the proposed system, from which we obtain decidable type-correctness. Our result holds under the assumption that the call relation of the recursive definitions is well-f...
متن کاملUnification of Infinite Sets of Terms Schematized by Primal Grammars
Innnite sets of terms appear frequently at diierent places in computer science. On the other hand, several practically oriented parts of logic and computer science require the manipulated objects to be nite or nitely representable. Schematizations present a suitable formalism to manipulate nitely innnite sets of terms. Since schematizations provide a diierent approach to solve the same kind of ...
متن کاملFixed Points of Type Constructors and Primitive Recursion
For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point unfolding. Two solutions of this problem are proposed: The first one is a system with equi-recursive nonstrictly positive type constructors of arbitrary finite kinds, where fixedpoint unfolding is computationally invisible due to...
متن کامل